in these terms the problem can be formulated as follows

См. также в других словарях:

• Problem of Apollonius — In Euclidean plane geometry, Apollonius problem is to construct circles that are tangent to three given circles in a plane (Figure 1); two circles are tangent if they touch at a single point. Apollonius of Perga (ca. 262 BC ndash; ca. 190 BC)… …   Wikipedia

• Problem of evil — Part of a series on God General conceptions …   Wikipedia

• The Nature of Rationality — is an exploration of practical rationality written by Robert Nozick and published in 1993. It views human rationality as an evolutionary adaptation. Its delimited purpose and function may be responsible for biases and blind spots, possibly… …   Wikipedia

• The Blessed Trinity —     The Blessed Trinity     † Catholic Encyclopedia ► The Blessed Trinity     This article is divided as follows:          I. Dogma of the Trinity;     II. Proof of the Doctrine from Scripture;     III. Proof of the Doctrine from Tradition;… …   Catholic encyclopedia

• THE MIDDLE AGES — …   Encyclopedia of Judaism

• Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… …   Wikipedia

• P = NP problem — The relationship between the complexity classes P and NP is an unsolved question in theoretical computer science. It is considered to be the most important problem in the field – the Clay Mathematics Institute has offered a $1 million US prize… …   Wikipedia

• The Holocaust — Holocaust and Shoah redirect here. For other uses, see Holocaust (disambiguation) and Shoah (disambiguation). Selection on …   Wikipedia

• Burnside's problem — The Burnside problem, posed by William Burnside in 1902 and one of the oldest and most influential questions in group theory, asks whether a finitely generated group in which every element has finite order must necessarily be a finite group. In… …   Wikipedia

• P versus NP problem — Unsolved problems in computer science Is P = NP ? …   Wikipedia

• Hadwiger–Nelson problem — Unsolved problems in mathematics How many colors are needed to color the plane so that no two points at unit distance are the same color? In geometric graph theory, the Hadwiger–Nelson problem, named after Hugo Hadwiger and Edward Nelson, asks… …   Wikipedia